A heuristic approach for the distance-based critical node detection problem in complex networks

The distance-based critical node problem involves identifying a subset of nodes in network whose removal minimises pre-defined connectivity measure. Having the classical as special case, is computationally challenging. In this article, we study from heuristic algorithm perspective. We consider objective goal to minimise number pairs connected by path length at most k, subject budgetary constraints. propose centrality based which combines backbone-based crossover procedure generate good offspring solutions and centrality-based neighbourhood search improve solution. Extensive computational experiments on real-world synthetic graphs show effectiveness developed generating when compared exact Our empirical results also provide useful insights for future development.